Smith normal form in combinatorics
نویسنده
چکیده
This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith normal form of random integer matrices. We then give some examples of Smith normal form and diagonal form arising from (1) symmetric functions, (2) a result of Carlitz, Roselle, and Scoville, and (3) the Varchenko matrix of a hyperplane arrangement.
منابع مشابه
Monomial Ideals
Monomial ideals form an important link between commutative algebra and combinatorics. In this chapter, we demonstrate how to implement algorithms in Macaulay 2 for studying and using monomial ideals. We illustrate these methods with examples from combinatorics, integer programming, and algebraic geometry.
متن کاملCodes and modules associated with designs and t-uniform hypergraphs
The first part of these lectures introduces the Smith normal form and the invariant factors of an integer matrix, and the relation of Smith form to systems of linear diophantine equations. We give selected examples of how invariant factors appear and may be applied to the theory of combinatorial designs. Importantly, we may sometimes construct sefl-dual p-ary codes from hypothetical designs and...
متن کاملEfficiency of Indirect Selection to Improve Yield and Drought Tolerance in Populations Derived from Inter-Specific Hybridization of Soft Flower
The use of appropriate selection methods are important to increase yield in breeding programs. Utilization of selection indices is one of the most effective method for selection of superior genotypes to improve the complex traits such as seed yield. In order to evaluate the efficiency of different selection methods, 63 families of two F3 populations derived from inter-specific hybridization of ...
متن کاملFast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices*
Boolean circuits of polynomial size and poly-logarithmic depth are given for computing the Hermite and Smith normal forms of polynomial matrices over finite fields and the field of rational numbers. The circuits for the Smith normal form computation are probabilistic ones and also determine very efficient sequential algorithms. Furthermore, we give a polynomial-time deterministic sequential alg...
متن کاملParallel Algorithm for Computing the Smith Normal Form of Large Matrices
Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large dense matrices. The computation has two main problems: the high execution time and the memory requirements, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 144 شماره
صفحات -
تاریخ انتشار 2016